Walling in Strategy Games via Constraint Optimization
نویسندگان
چکیده
This paper presents a constraint optimization approach to walling in real-time strategy (RTS) games. Walling is a specific type of spatial reasoning, typically employed by human expert players and not currently fully exploited in RTS game AI, consisting on finding configurations of buildings to completely or partially block paths. Our approach is based on local search, and is specifically designed for the real-time nature of RTS games. We present experiments in the context of the RTS game StarCraft showing promising results.
منابع مشابه
ghost: A Combinatorial Optimization Framework for Real-Time Problems
This paper presents GHOST, a combinatorial optimization framework that a Real-Time Strategy (RTS) AI developer can use to model and solve any problem encoded as a constraint satisfaction/optimization problem. We show a way to model three different problems as a constraint satisfaction/optimization problem, using instances from the RTS game StarCraft as test beds. Each problem belongs to a speci...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملRevisiting Generalized Nash Games and Variational Inequalities
Generalized Nash games represent an extension of Nash games in which strategy sets are coupled across players. The equilibrium conditions of such a game can be compactly stated as a quasivariational inequality (QVI), an extension of the variational inequality (VI). Harker [9] showed that under certain conditions on the maps defining the QVI, a solution to a related VI solves the QVI. This is a ...
متن کاملCongestion Games with Polytopal Strategy Spaces
Congestion games are a well-studied class of games that has been used to model real-world systems such as Internet routing. In many congestion games, each player’s number of strategies can be exponential in the natural description of the game. Most existing algorithms for game theoretic computation, from computing expected utilities and best responses to finding Nash equilibrium and other solut...
متن کاملBI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS
In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...
متن کامل